Efficiency of Parallel Genetic Algorithm for Solving N-Queens Problem on Multicomputer Platform
نویسنده
چکیده
The paper investigates the efficiency of parallel genetic algorithm for solving N-queens problem on a multicomputer platform. The proposed parallel computational model of the genetic algorithm is based on a parallel algorithmic paradigm of synchronous iterations. Dynamic migration of randomly selected chromosomes in a bidirectional circular model is utilized. The algorithm is implemented using both flat (pure MPI) and hybrid (MPI+OpenMP) programming models. The target parallel multicomputer platform is a cluster of SMPs. Performance profiling and scalability analyses have been made in respect of both the workload (board size) and the size of the parallel system. Key-Words: N-queens problem, parallel genetic algorithm, island model, dynamic migration policy, multicomputer platform, profiling and performance analysis
منابع مشابه
A New Approach to Solve N-Queen Problem with Parallel Genetic Algorithm
Over the past few decades great efforts were made to solve uncertain hybrid optimization problems. The n-Queen problem is one of such problems that many solutions have been proposed for. The traditional methods to solve this problem are exponential in terms of runtime and are not acceptable in terms of space and memory complexity. In this study, parallel genetic algorithms are proposed to solve...
متن کاملSolving the Travelling Salesman Problem in Parallel by Genetic Algorithm on Multicomputer Cluster
The paper investigates the efficiency of the parallel computation of the travelling salesman problem using the genetic approach on a slack multicomputer cluster. For the parallel algorithm design functional decomposition of the parallel application has been made and the manager/workers paradigm is applied. Performance estimation and parallelism profiling have been made on the basis of MPI-based...
متن کاملSolving the Problem of Scheduling Unrelated Parallel Machines with Limited Access to Jobs
Nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. Unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. In some of the applications of unrelated parallel mac...
متن کاملSolving the Problem of Scheduling Unrelated Parallel Machines with Limited Access to Jobs
Nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. Unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. In some of the applications of unrelated parallel mac...
متن کاملSolving Redundancy Allocation Problem with Repairable Components Using Genetic Algorithm and Simulation Method
Reliability optimization problem has a wide application in engineering area. One of the most important problems in reliability is redundancy allocation problem (RAP). In this research, we worked on a RAP with repairable components and k-out-of-n sub-systems structure. The objective function was to maximize system reliability under cost and weight constraints. The aim was determining optimal com...
متن کامل